Coding for the Slepian-Wolf problem with turbo codes
نویسندگان
چکیده
This paper proposes a practical coding scheme for the Slepian-Wolf problem of separate encoding of correlated sources. Finite-state machine (FSM) encoders, concatenated in parallel, are used at the transmit side and an iterative turbo decoder is applied at the receiver. Simulation results of system performance are presented for binary sources with different amounts of correlation. Obtained results show that the proposed technique outperforms by far both an equivalent uncoded system and a system coded with traditional (non-concatenated) FSM coding.
منابع مشابه
Density Evolution Technique for LDPC Codes in Slepian-Wolf Coding of Nonuniform Sources
This paper attempts to examine the optimality of LDPC codes for compression of nonuniform source with Slepian-Wolf coding using density evolution technique. The primary goal is to evaluate the performance of LDPC codes with reference to turbo codes (in SF-ISF setup). The appreciable difference between LDPC and turbo codes is also discussed in this paper. The threshold values obtained from the d...
متن کاملDistributed arithmetic coding for the Slepian-Wolf problem
Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, named “distributed arithmetic coding”, which extends arithmetic codes to the distributed case employing sequential decoding aided by the side information. In particular, we introduce a distributed binary arithmetic coder for the Slepian-Wolf coding problem...
متن کاملDistributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem
Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed “distributed arithmetic coding”, which exploits the fact that arithmetic codes are good source as well as channel codes. In particular, we propose a distributed binary arithmetic coder for Slepian-Wolf coding with decoder side information, along wit...
متن کاملSlepian-Wolf turbo coding of video with non-stationary side-information
In the early seventies, Slepian and Wolf first introduced source coding with side-information at the decoder. This coding principle allows for a low-complexity encoder, provided that the decoder has access to a sideinformation signal that is dependent on the source signal. In video source coding, we are able to generate this side-information by using a predictive video model. In the last decade...
متن کاملApproaching the Slepian-Wolf Limit with LDPC Coset Codes
We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalen...
متن کامل